Selecting the Best Splits for Classification Trees With Categorical Variables

نویسنده

  • Yu-Shan Shih
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selecting the best categorical split for classification trees

Based on a family of splitting criteria for classification trees, methods of selecting the best categorical splits are studied. They are shown to be very useful in reducing the computational complexity of the exhaustive search method. Keyword: classification tree; power divergence; splitting criteria

متن کامل

Split Selection Methods for Classification Trees

Classification trees based on exhaustive search algorithms tend to be biased towards selecting variables that afford more splits. As a result, such trees should be interpreted with caution. This article presents an algorithm called QUEST that has negligible bias. Its split selection strategy shares similarities with the FACT method, but it yields binary splits and the final tree can be selected...

متن کامل

Classification Tree Analysis as Applied to Mena Regions

IICR and ICRG country risk scores are examined in a decision tree framework to analyze groupings on countries, including Middle East and North Africa. INTRODUCTION The purpose of this paper is to examine if Middle East and North Africa (MENA) countries form a distinct financial risk group, based on financial predictor variables and country risk scores. Country risk scores are calculated interna...

متن کامل

Building Consensus with Balanced Splits

Given the multitude of sources for reconstructing the evolutionary history between entities, phylogenetic reconstruction methods often provide several trees classifying these entities. A key step in reconciling the different trees is to construct a consensus view of the history. If we consider each tree as a collection of laminar splits (two-way partitions), the primary problem in arriving at a...

متن کامل

Analysis of Company Growth Data Using Genetic Algorithms on Binary Trees

This paper investigates why some companies grow faster than others, by data mining a survey of a large number of companies in Flanders (the northern part of Belgium). Faster or slower average growth over a time period is explained by building a classification tree containing several categorical variables (both quantitative and qualitative). The technique used – called genAID – splits the popula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007